11 research outputs found

    Link State Contract Routing

    Get PDF
    The Internet's simple design resulted in huge success in basic telecommunicationservices. However, the current Internet architecture has failed in terms of introducingmany innovative technologies as end-to-end (E2E) services such as multicasting,guaranteed quality of services (QoS) and many others. We argue that contractingover static service level agreements (SLA) and point-to-anywhere service definitionsare the main reasons behind this failure. In that sense, the Internet architecture needsmajor shifts since it neither allows (i) users to indicate their value choices at sufficientgranularity nor (ii) providers to manage risks involved in investment for new innovativeQoS technologies and business relationships with other providers as well as users.To allow these much needed economic flexibilities, we introduce contract-switching asa new paradigm for the design of future Internet architecture. In this work, we implementcontract-routing framework with specific focus on long-term contracted servicesin Link State Contract Routing scheme. Our work shows that E2e guaranteed QoSservices can be achieved in routing over contracted edge-to-edge service abstractionswhich are built on today's popular protocols with reasonable protocol overhead

    Contract Routing Architecture

    No full text
    The current Internet architecture has been principally designed for overcoming the interoperability issues between previously disconnected network islands. Since the focus was to ensure openness and connectivity, the architecture maintained simplistic core functionalities, i.e., the set of the capabilities that have to be compatible among the Internet stakeholders. Routing, which is the negotiation of end-to-end data paths, has been successfully handled so far, since the only expectation from the Internet was to provide the basic end-to-end connectivity. Today, however, customers are not only looking for a connectivity that just works but also supports a plethora of applications that require low-latency, high-bandwidth, and secure connections to the rest of theworld. Such value-added services cannot be realized effectively mainly because the Internet core is economically rigid and only allows bilateral, single-metric negotiation of paths in a coarse-grained manner. The revenue sharing model built on this rigid economics is unhealthy and incapable of addressing the long-term sustainability and innovation at all parts (i.e., core, edge, and end) of the Internet. To overcome these limitations, we propose Contract Routing Architecture that enables users and Internet Service Providers (ISPs) i) to express their perceived economic value of offered services, and ii) to negotiate end-to-end quality of paths with other stakeholders ina multi-lateral manner considering multiple performance metrics. In this thesis, we describe how multi-metric, multi-hop path negotiations can be achieved in a scalable manner while making economics an inherent part of routing process itself so as to amend broken revenue model of the current Internet

    Effectiveness of Multi-Hop Negotiation on the Internet

    No full text
    Abstract—Inter-domain routing has been long considered as an ongoing negotiation on end-to-end paths between service providers. Such negotiations were often believed to be effective in their form of bilateral and single-hop interactions between neighboring ISPs in a rather hierarchical market structure. Traffic engineering policies, multi-homing schemes and peering mechanisms have been often employed as only service perfor-mance improvement methods within this localized approach. However, several measurement studies on inter-domain routing have revealed that these methods are not effective at capturing diversity in performance levels and alternative paths offered by the Internet. Recently, several clean-slate Internet architecture proposals have introduced multi-hop negotiation mechanisms in an effort to revitalize inter-domain routing on the Internet. In this work, we quantify how effective these local policy exceptions can be in providing better quality paths. We also analyze the increasing benefits ripened by broadening wide-area route control capabilities of an ISP. Our analysis on traces captured from the Internet quantitatively shows that currently adopted local and single-hop policies are effective only to a certain extent, and multi-hop negotiation mechanisms can significantly increase the quality and performance of end-to-end paths. I

    Offloading routing complexity to the Cloud(s)

    No full text
    Abstract—We propose a new architectural approach, Cloud-Assisted Routing (CAR), that leverages high computation and memory power of cloud services for easing complex routing functions such as forwarding and flow level policy management. We aim to mitigate the increasing routing complexity to the cloud and to seek an answer to the following question: “Can techniques leveraging the memory and computation resources of the cloud remedy the routing scalability issues? ” The key contribution of our work is to outline a framework on how to integrate cloud computing with routers and define operational regions where such integration is beneficial. Index Terms—cloud-assisted routing; software-defined net-working; routing scalability I

    Multi Path Considerations for Anonymized Routing: Challenges and Opportunities

    No full text
    Abstract—Recently, there has been a surging interest on anonymizer technologies as a result of increasing privacy concerns and raising censorship barriers around the world. Tor network has emerged as the most popular option in avail thanks to its large volunteer base. However, popularity of Tor network is under threat of growing user frustration over low throughput and long latencies. Coincidentally multi-path routing proposals have become popular in tackling the similar performance issues in various contexts from data center networks to inter-domain routing. In this work, we apply multi-path techniques so as to overcome limitations in Tor’s path construction and rigid congestion avoidance mechanisms which are major factors behind the unsatisfactory user experience. It turns out that multipath mechanisms nicely complement underlying onion-routing mechanisms of Tor via exploiting diversity in Tor network. Our preliminary evaluation on live Tor network revealed the significant potential of performance improvements achieved by multi-path techniques especially in increasing throughput which can offer up to 4 times speed up in data transmission durations. Also, multi-path mechanisms may increase reliability of the overall system against congestion or service-interruption based attacks in return of acceptable anonymity trade-offs. Besides these very promising features, application of multi-path techniques on anonymized routing introduces many open research questions calling for further research on data splitting, path construction, latency estimation techniques whose findings can benefit many research areas. I
    corecore